Unveiling causal activity of complex networks
نویسندگان
چکیده
منابع مشابه
Unveiling causal activity of complex networks
We introduce a novel tool for analyzing complex network dynamics, allowing for cascades of causally-related events, which we call causal webs (c-webs), to be separated from other non-causally-related events. This tool shows that traditionally-conceived avalanches may contain mixtures of spatially-distinct but temporally-overlapping cascades of events, and dynamical disorder or noise. In contras...
متن کاملUnveiling the Relationship Between Structure and Dynamics in Complex Networks
Over the last years, a great deal of attention has been focused on complex networked systems, characterized by intricate structure and dynamics [1–6]. The latter has been often represented in terms of overall statistics (e.g. average and standard deviations) of the time signals [1]. While such approaches have led to many insights, they have failed to take into account that signals at different ...
متن کاملUnveiling the relationship between complex networks metrics and word senses
The automatic disambiguation of word senses (i.e., the identification of which of the meanings is used in a given context for a word that has multiple meanings) is essential for such applications as machine translation and information retrieval, and represents a key step for developing the so-called Semantic Web. Humans disambiguate words in a straightforward fashion, but this does not apply to...
متن کاملSWIM: a computational tool to unveiling crucial nodes in complex biological networks
SWItchMiner (SWIM) is a wizard-like software implementation of a procedure, previously described, able to extract information contained in complex networks. Specifically, SWIM allows unearthing the existence of a new class of hubs, called "fight-club hubs", characterized by a marked negative correlation with their first nearest neighbors. Among them, a special subset of genes, called "switch ge...
متن کاملUnveiling community structures in weighted networks.
Random walks on simple graphs in connection with electrical resistor networks lead to the definition of Markov chains with transition probability matrix in terms of electrical conductances. We extend this definition to an effective transition matrix Pij to account for the probability of going from vertex i to any vertex j of the original connected graph G. Also, we present an algorithm based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2017
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/119/18003